Generalized constraint propagation over the CLP scheme
نویسندگان
چکیده
منابع مشابه
Clp(cf) Constraint Logic Programming over Complex Functions ?
A constraint logic programming system for the domain of complex functions is described. The intended users of the language are scientist and engineers who often reason/compute with constraints over complex functions, such as functional equalities, diierential equations, etc. Constraints are solved by iterating several solving methods such as Laplace transformation, non-linear equation solving, ...
متن کاملRISC-CLP(CF) Constraint Logic Programming over Complex Functions
A constraint logic programming system for the domain of complex functions is described. The intended users of the language are scientist and engineers who often reason/compute with constraints over complex functions, such as functional equalities, diierential equations, etc. Constraints are solved by iterating several solving methods such as Laplace transformation, non-linear equation solving, ...
متن کاملGeneralized Constraint Solving over Differential Algebras
We describe an algorithm for quantifier elimination over differentially closed fields and its implementation within the computer logic package redlog of the computer algebra system reduce. We give various application examples, which on the one hand demonstrate the applicability of our software to non-trivial problems, and on the other hand give a good impression of the possible range of applica...
متن کاملConstraint Satisfaction over Generalized Staircase Constraints
One of the key research interests in the area of Constraint Satisfaction Problem (CSP) is to identify tractable classes of constraints and develop efficient solutions for them. In this paper, we introduce generalized staircase (GS) constraints which is an important generalization of one such tractable class found in the literature, namely, staircase constraints. GS constraints are of two kinds,...
متن کاملRAPPORT Value constraints in the CLP scheme
This paper addresses the question of how to incorporate constraint propagation into logic programming. A likely candidate is the CLP scheme, which allows one to exploit algorithmic opportunities while staying within logic programming semantics. CLP(R) is an example: it combines logic programming with the algorithms for solving linear equalities and inequalities. In this paper we describe two co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1993
ISSN: 0743-1066
DOI: 10.1016/0743-1066(93)90047-k